Set-mappings on Dedekind sets.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set-ΛΛαppings on Dedekind Sets

HajnaPs free set principle is equivalent to the axiom of choice, and some of its variants for Dedekind-finite sets are equivalent to countable forms of the axiom of choice. As was observed by Freiling [4] in the case of X = IR, if one applies some heuristics about selecting elements of X at random, one obtains assertions of the form "Every set-mapping/:X-> I (x£f(x)) has a nontrivial free subse...

متن کامل

forR1 ultrafilter mappings and their Dedekind cuts

Associated to each ultrafilter U on ω and each map p : ω → ω is a Dedekind cut in the ultrapower ω/p(U). Blass has characterized, under CH, the cuts obtainable when U is taken to be either a p-point ultrafilter, a weakly-Ramsey ultrafilter or a Ramsey ultrafilter. Dobrinen and Todorcevic have introduced the topological Ramsey spaceR1. Associated to the spaceR1 is a notion of Ramsey ultrafilter ...

متن کامل

Ultrafilter Mappings and Their Dedekind Cuts

Let D be an ultrafilter on the set N of natural numbers. To each function p: N — N and each ultrafilter E that is mapped to D by p, we associate a Dedekind cut in the ultrapower ö-prod N. We characterize, in terms of rather simple closure conditions, the cuts obtainable in this manner when various restrictions are imposed on E and p. These results imply existence theorems, some known and some n...

متن کامل

A dedekind finite borel set

In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2 is a Gδσ-set then either B is countable or B contains a perfect subset. Second, we prove that if 2 is the countable union of countable sets, then there exists an Fσδ set C ⊆ 2 such that C is uncountable but contains no perfect subset. Finally, we c...

متن کامل

Analytic Mappings on Hyperfinite Sets

Let S and T be hyperfinite sets in an N]-saturated nonstandard universe. The following are equivalent: m 1*1 ~ l (l) rff ~ • • (ii) There is a bijection from 5 onto T whose graph is Borel (over the internal subsets of S x T). This follows from somewhat more general results about analytic partial functions on hyperfinite sets, the proofs of which use Choquet's theorem on the capacitibility of an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1989

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093635083